\relax 
\citation{LinearProgrammingInLinearTime}
\citation{MinimumPolygonalSeparation}
\citation{Aggarwal:1985}
\citation{DasJoseph:1990}
\citation{DigitalDiskAndCompacness}
\citation{SeparatingPointsByCricles}
\citation{SeparationBySphericalSurfaces}
\citation{DigitalDiskAndCompacness}
\citation{ComputingCircularSeparabilityOfPlanarPointSets}
\citation{ComputingCircularSeparability}
\@writefile{toc}{\contentsline {title}{Lecture Notes in Computer Science}{1}}
\@writefile{toc}{\authcount {2}}
\@writefile{toc}{\contentsline {author}{Authors' Instructions}{1}}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}}
\citation{ComputingCircularSeparability}
\@writefile{toc}{\contentsline {section}{\numberline {2}Preliminaries}{2}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8.5\p@ plus3\p@ minus4\p@ \abovedisplayshortskip \z@ plus2\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ {\leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ }\belowdisplayskip \abovedisplayskip Every separating circle containing only one vertex of $P$ on its boundary contains another separating circle with smaller radius containing at least two vertices.}}{3}}
\newlabel{fig:Centro en V(P)}{{1}{3}}
\@writefile{toc}{\contentsline {section}{\numberline {3}The minimum separating circle}{3}}
\newlabel{section:Resultados}{{3}{3}}
\newlabel{Relation P-circle separating circle}{{1}{3}}
\newlabel{Monotonia de Rho}{{1}{3}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8.5\p@ plus3\p@ minus4\p@ \abovedisplayshortskip \z@ plus2\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ {\leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ }\belowdisplayskip \abovedisplayskip For every point $z\in [x,y]$ the circle $C(z)$ lies in the union of $C(x)$ and $C(y)$.}}{4}}
\newlabel{fig:CirculosEnSegmento}{{2}{4}}
\newlabel{CirculosEnSegmento}{{2}{4}}
\newlabel{AncestroSeparadorGral}{{1}{4}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8.5\p@ plus3\p@ minus4\p@ \abovedisplayshortskip \z@ plus2\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ {\leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ }\belowdisplayskip \abovedisplayskip The proof of Lemma\nobreakspace  {}1\hbox {}.}}{5}}
\newlabel{fig:AncestroComun}{{3}{5}}
\newlabel{c' en T_s}{{1}{5}}
\newlabel{TangentToQ}{{1}{5}}
\@writefile{toc}{\contentsline {section}{\numberline {4}The algorithm}{5}}
\citation{LinearVoronoiDiagramForConvexPolygon}
\citation{LinearTimeAlgorithmsForLinearProgramming}
\citation{ComputingExtremeDistancesBetweenConvexPolygons}
\citation{ConstrainedMinimumEnclosingCircleWithCenterOnAQueryLineSegment}
\citation{ConstrainedMinimumEnclosingCircleWithCenterOnAQueryLineSegment}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Preprocessing}{6}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8.5\p@ plus3\p@ minus4\p@ \abovedisplayshortskip \z@ plus2\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ {\leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ }\belowdisplayskip \abovedisplayskip The data structure on $\mathcal  {V}(P)$ as seen on a path with 32 vertices.}}{6}}
\newlabel{fig:DataStructure}{{4}{6}}
\citation{ComputingExtremeDistancesBetweenConvexPolygons}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}The search for $c'$ on the tree}{7}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8.5\p@ plus3\p@ minus4\p@ \abovedisplayshortskip \z@ plus2\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ {\leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ }\belowdisplayskip \abovedisplayskip Construction of $s$.}}{7}}
\newlabel{fig:PrimerCirculoSeparador}{{5}{7}}
\citation{ConstrainedMinimumEnclosingCircleWithCenterOnAQueryLineSegment}
\citation{ComputingExtremeDistancesBetweenConvexPolygons}
\citation{ConstrainedMinimumEnclosingCircleWithCenterOnAQueryLineSegment}
\citation{ConstrainedMinimumEnclosingCircleWithCenterOnAQueryLineSegment}
\@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces Oracle algorithm to determine if $C(v)$ is a separating circle}}{8}}
\newlabel{alg:FirstPhase}{{4.2}{8}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {2}{\ignorespaces First phase}}{8}}
\newlabel{alg:paso2}{{2}{8}}
\newlabel{alg:SecondPhase}{{4.2}{9}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {3}{\ignorespaces Second phase}}{9}}
\newlabel{alg2:paso1}{{1}{9}}
\newlabel{alg2:paso2}{{2}{9}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8.5\p@ plus3\p@ minus4\p@ \abovedisplayshortskip \z@ plus2\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ {\leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ }\belowdisplayskip \abovedisplayskip The set $Q_S$ and the point $q'$ defined as the only intersection point between $C'$ and the boundary of $Q$.}}{9}}
\newlabel{fig:RegionQ_S}{{6}{9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Searching on the segment}{10}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces \relax \fontsize  {9}{11}\selectfont  \abovedisplayskip 8.5\p@ plus3\p@ minus4\p@ \abovedisplayshortskip \z@ plus2\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def \leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ {\leftmargin \leftmargini \parsep 0\p@ plus1\p@ minus\p@ \topsep 8\p@ plus2\p@ minus4\p@ \itemsep 0\p@ }\belowdisplayskip \abovedisplayskip Since the circle $C(u)$ intersects $Q$ in more that two points, $\tau (x)$ is not a unimodal function when defined on the boundary of $Q$, nevertheless it is unimodal when defined on $Q_S$.}}{10}}
\newlabel{fig:NotUnimodalInAllQ}{{7}{10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.4}The search for $q'$}{11}}
\newlabel{alg:SearchInQ}{{4.4}{11}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {4}{\ignorespaces Search for $q'$ on $Q_{S}^{*} = \{q_0, q_1, \ldots  , q_{k}\}$}}{11}}
\bibcite{DigitalDiskAndCompacness}{1}
\bibcite{ComputingCircularSeparabilityOfPlanarPointSets}{2}
\bibcite{SeparatingPointsByCricles}{3}
\bibcite{ComputingExtremeDistancesBetweenConvexPolygons}{4}
\bibcite{MinimumPolygonalSeparation}{5}
\bibcite{ComputingCircularSeparability}{6}
\bibcite{SeparationBySphericalSurfaces}{7}
\bibcite{LinearTimeAlgorithmsForLinearProgramming}{8}
\bibcite{LinearProgrammingInLinearTime}{9}
\bibcite{LinearVoronoiDiagramForConvexPolygon}{10}
\bibcite{ConstrainedMinimumEnclosingCircleWithCenterOnAQueryLineSegment}{11}
\bibcite{DasJoseph:1990}{12}
\bibcite{Aggarwal:1985}{13}
\@writefile{toc}{\contentsline {section}{\numberline {5}Closing Remarks}{12}}
